ar X iv : c s . C C / 0 20 50 56 v 1 2 1 M ay 2 00 2 Parameterized Intractability of Motif Search Problems ∗
نویسندگان
چکیده
We show that Closest Substring, one of the most important problems in the field of biological sequence analysis, is W[1]-hard when parameterized by the number k of input strings (and remains so, even over a binary alphabet). This problem is therefore unlikely to be solvable in time O(f(k) · n) for any function f of k and constant c independent of k. The problem can therefore be expected to be intractable, in any practical sense, for k ≥ 3. Our result supports the intuition that Closest Substring is computationally much harder than the special case of Closest String, although both problems are NP-complete. We also prove W[1]-hardness for other parameterizations in the case of unbounded alphabet size. Our W[1]-hardness result for Closest Substring generalizes to Consensus Patterns, a problem of similar significance in computational biology.
منابع مشابه
ar X iv : c s . C L / 0 20 50 28 v 1 1 7 M ay 2 00 2 NLTK : The Natural Language Toolkit
NLTK, the Natural Language Toolkit, is a suite of open source program modules, tutorials and problem sets, providing ready-to-use computational linguistics courseware. NLTK covers symbolic and statistical natural language processing, and is interfaced to annotated corpora. Students augment and replace existing components, learn structured programming by example, and manipulate sophisticated mod...
متن کاملar X iv : m at h / 04 11 14 0 v 2 [ m at h . N T ] 4 M ay 2 00 5 THE 3 x + 1 SEMIGROUP
The 3x + 1 semigroup is the multiplicative semigroup S of positive rational numbers generated by { 2k+1 3k+2 : k ≥ 0} together with {2}. This semigroup encodes backwards iteration under the 3x + 1 map, and the 3x + 1 conjecture implies that it contains every positive integer. This semigroup is proved to be the set of positive rationals a b in lowest terms with b 6≡ 0( mod 3), and so contains al...
متن کاملar X iv : c s . IT / 0 50 50 54 v 1 2 1 M ay 2 00 5 The Partition Weight Enumerator of MDS Codes and its Applications
A closed form formula of the partition weight enumerator of maximum distance separable (MDS) codes is derived for an arbitrary number of partitions. Using this result, some properties of MDS codes are discussed. The results are extended for the average binary image of MDS codes in finite fields of characteristic two. As an application, we study the multiuser error probability of Reed Solomon co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002